A Study of Constraint-based Routing with MPLS
نویسندگان
چکیده
This paper presents simulation and analysis of constraint-based routing (CR) with MPLS (multiprotocol label switching). MPLS is basically a fast forwarding scheme for the core of the Internet. Constraint-based routing computes routes that are subject to constraints to meet QoS (quality of service) requirements. Constraint-based routing with MPLS greatly enhances network utilization and enables advanced traffic engineering functionality. We review a previously published example, and discuss its advantages and shortcomings. We present a revised example, and demonstrate how to select better packet sizes for the data sources, measured by bandwidth at sink, packet loss rate, average end-to-end delay, delay distribution, and jitter.
منابع مشابه
Using a Fuzzy Rule-based Algorithm to Improve Routing in MPLS Networks
Today, the use of wireless and intelligent networks are widely used in many fields such as information technology and networking. There are several types of these networks that MPLS networks are one of these types. However, in MPLS networks there are issues and problems in the design and implementation discussion, for example security, throughput, losses, power consumption and so on. Basically,...
متن کاملA case study on evaluating the benefits of MPLS traffic engineering through constraint-based routing and network controls
In this paper, we attempt to understand the benefits of MPLS traffic engineering through a case study. Specifically, we do a comparative study of MPLS traffic engineering in the presence of dynamic constraint-based routing compared to destination-based routing. For this case study, we use a model derived from an actual service provider network. Different control schemes that can be deployable f...
متن کاملA Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint
In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...
متن کاملAn Overview of MPLS and Constraint Based Routing
Multiprotocol Label Switching provides a virtual path capability between packet (label) switches to efficiently carry differentiated services across the Internet. Additionally, MPLS has been enhanced with the capability to precisely engineer traffic tunnels to avoid congestion and utilize all available bandwidth in an efficient manner. This paper provides an extensive resource, serving the moti...
متن کاملAdvanced Fuzzy Class-Based Routing in MPLS-TE Networks
The paper focuses on optimizing MPLS-TE networks using Constraint-Based Routing algorithm with implemented fuzzy logic. CBR includes routing algorithms that do not make routing decisions solely on the shortest path towards the destination but they can also base their decisions on various Quality of Service parameters or administrative needs. MPLS-TE networks can benefit from implementing such a...
متن کامل